package com.lintcode.solution;

import com.lintcode.solution.entity.Point;

import java.util.HashMap;
import java.util.Map;

public class Solution_168 {
    public static void main(String[] args) {
        Point[] points = {};
        System.out.println(maxPoints(points));
    }
    
    public static int maxPoints(Point[] points) {
        int result = 0;
        Map<Double, Integer> map = new HashMap<>();
        for (Point point : points) {
            Double k = (double) point.y / point.x;
            map.merge(k, 1, (a, b) -> a + b);
        }
        for (Double aDouble : map.keySet()) {
            result = Math.max(result, map.get(aDouble));
        }
        return result;
    }
}
